Tree formulas, mean first passage times and Kemeny’s constant of a Markov chain

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tree formulas, mean first passage times and Kemeny's constant of a Markov chain

This paper offers some probabilistic and combinatorial insights into tree formulas for the Green function and hitting probabilities of Markov chains on a finite state space. These tree formulas are closely related to loop-erased random walks by Wilson’s algorithm for random spanning trees, and to mixing times by the Markov chain tree theorem. Let mij be the mean first passage time from i to j f...

متن کامل

Markov Chain Sensitivity Measured by Mean First Passage Times

The purpose of this article is to present results concerning the sensitivity of the stationary probabilities for a n-state, time-homogeneous, irreducible Markov chain in terms of the mean first passage times in the chain.

متن کامل

Stationary Distributions and Mean First Passage Times of Perturbed Markov Chains

Stationary distributions of perturbed finite irreducible discrete time Markov chains are intimately connected with the behaviour of associated mean first passage times. This interconnection is explored through the use of generalized matrix inverses. Some interesting qualitative results regarding the nature of the relative and absolute changes to the stationary probabilities are obtained togethe...

متن کامل

A Graph Theoretic Interpretation of the Mean First Passage Times

Let mij be the mean first passage time from state i to state j in an n-state ergodic homogeneous Markov chain with transition matrix T . Let G be the weighted digraph without loops whose vertex set is the set of states of the Markov chain and arc weights are equal to the corresponding transition probabilities. We show that

متن کامل

Generalized Inverses, Stationary Distributions and Mean First Passage Times with applications to Perturbed Markov Chains

Abstract In an earlier paper (Hunter, 2002) it was shown that mean first passage times play an important role in determining bounds on the relative and absolute differences between the stationary probabilities in perturbed finite irreducible discrete time Markov chains. Further when two perturbations of the transition probabilities in a single row are carried out the differences between the sta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bernoulli

سال: 2018

ISSN: 1350-7265

DOI: 10.3150/16-bej916